Take It NP-Easy: Bounded Model Construction for Duration Calculus
نویسنده
چکیده
Following the recent successes of bounded model-checking, we reconsider the problem of constructing models of discrete-time Duration Calculus formulae. While this problem is known to be non-elementary when arbitrary length models are considered [Han94], it turns out to be only NP-complete when constrained to bounded length. As a corollary we obtain that model construction is in NP for the formulae actually encountered in case studies using Duration Calculus, as these have a certain small-model property. First experiments with a prototype implementation of the procedures demonstrate a competitive performance.
منابع مشابه
Easy/Hard Transition in k-SAT
A heuristic model procedure for determining satisfiability of CNF-formulae is set up and described by nonlinear recursion relations for m (number of clauses), n (number of variables) and clause filling k. The system mimicked by the recursion undergoes a sharp transition from bounded running times (=”easy”) to uncontrolled runaway behaviour (=”hard”). Thus the parameter space turns out to be sep...
متن کاملOn the Complexity of Parity Games
Parity games underlie the model checking problem for the modal μ-calculus, the complexity of which remains unresolved after more than two decades of intensive research. The community is split into those who believe this problem – which is known to be both in NP and coNP – has a polynomial-time solution (without the assumption that P = NP) and those who believe that it does not. (A third, pessim...
متن کاملClique-Width and Parity Games
The question of the exact complexity of solving parity games is one of the major open problems in system verification, as it is equivalent to the problem of model-checking the modal mu-calculus. The known upper bound is NP intersection co-NP, but no polynomial algorithm is known. It was shown that on tree-like graphs (of bounded tree-width and DAG-width) a polynomial-time algorithm does exist. ...
متن کاملThe resource-constraint project scheduling problem of the project subcontractors in a cooperative environment: Highway construction case study
Large-scale projects often have several activities which are performed by subcontractors with limited multi-resources. Project scheduling with limited resources is one of the most famous problems in the research operations and optimization cases. The resource-constraint project scheduling problem (RCPSP) is a NP-hard problem in which the activities of a project must be scheduled to reduce the p...
متن کاملA Linguistic Characterization of Bounded Oracle Computation and Probabilistic Polynomial Time
We present a higher-order functional notation for polynomial-time computation with an arbitrary 0; 1valued oracle. This formulation provides a linguistic characterization for classes such as NP and BPP, as well as a notation for probabilistic polynomialtime functions. The language is derived from Hofmann’s adaptation of Bellantoni-Cook safe recursion, extended to oracle computation via work der...
متن کامل